Approximating Minimum-Area Rectangular and Convex Containers for Packing Convex Polygons
نویسندگان
چکیده
We investigate the problem of finding a minimum-area container for the disjoint packing of a set of convex polygons by translations. In particular, we consider axis-parallel rectangles or arbitrary convex sets as containers. For both optimization problems which are NP-hard we develop efficient constant factor approximation algorithms.
منابع مشابه
Approximating Smallest Containers for Packing Three-Dimensional Convex Objects
We investigate the problem of computing a minimum volume container for the non-overlapping packing of a given set of three-dimensional convex objects. Already the simplest versions of the problem are NPhard so that we cannot expect to find exact polynomial time algorithms. We give constant ratio approximation algorithms for packing axis-parallel (rectangular) cuboids under translation into an a...
متن کاملEqual Area Polygons in Convex Bodies
In this paper, we consider the problem of packing two or more equal area polygons with disjoint interiors into a convex body K in E such that each of them has at most a given number of sides. We show that for a convex quadrilateral K of area 1, there exist n internally disjoint triangles of equal area such that the sum of their areas is at least 4n 4n+1 . We also prove results for other types o...
متن کاملA Distributed Formation of Orthogonal Convex Polygons in Mesh-Connected Multicomputers
The rectangular faulty block model is the most commonly used fault model in designing a fault-tolerant and deadlockfree routing algorithm in mesh-connected multicomputers. The convexity of a rectangle facilitates simple and efficient ways to route messages around fault regions using relatively few virtual channels to avoid deadlock. However, such a faulty block may include many nonfaulty nodes ...
متن کاملAn algorithm for approximating nondominated points of convex multiobjective optimization problems
In this paper, we present an algorithm for generating approximate nondominated points of a multiobjective optimization problem (MOP), where the constraints and the objective functions are convex. We provide outer and inner approximations of nondominated points and prove that inner approximations provide a set of approximate weakly nondominated points. The proposed algorithm can be appl...
متن کاملFinding Minimum Area k-gons
Given a set P of n points in the plane and a number k, we want to find a polygon ~ with vertices in P of minimum area that satisfies one of the following properties: (1) cK is a convex k-gon, (2) ~ is an empty convex k-gon, or (3) ~ is the convex hull of exactly k points of P. We give algorithms for solving each of these three problems in time O(kn3). The space complexity is O(n) for k = 4 and ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- JoCG
دوره 8 شماره
صفحات -
تاریخ انتشار 2015